SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic

نویسندگان

چکیده

A new method to construct task graphs for $\mathcal{H}$-matrix arithmetic is introduced, which uses the information associated with all tasks of standard recursive algorithms, e.g., block index set matrix blocks involved in computation. Task refinement, i.e., replacement by subcomputations, then used proceed hierarchy until containing actual data are reached. This process a natural extension classical, way defined and thereby simplifies efficient usage many-core systems. Numerical examples model problems different structures demonstrate various properties approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Arithmetic for Matrix Pencils

We deene an algebra on matrix pencils that is a natural extension of sums, products and quotients of real numbers. The classical algebra of linear transformations may be regarded as a special case of the algebra of pencils. The sum and product deened here preserve right deeating subspaces. We show below that the matrix sign function and the inverse-free algorithms can be derived from an algebra...

متن کامل

Construction of a phonotactic dialect corpus using semiautomatic annotation

In this paper, we discuss rapid, semiautomatic annotation techniques of detailed phonological phenomena for large corpora. We describe the use of these techniques for the development of a corpus of American English dialects. The resulting annotations and corpora will support both largescale linguistic dialect analysis and automatic dialect identification. We delineate the semiautomatic annotati...

متن کامل

Graph Matrix Completion in Presence of Outliers

Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...

متن کامل

Bounds for Matrix Coefficients and Arithmetic Applications

— We explain an important result of Hee Oh [16] on bounding matrix coefficients of semi-simple groups and survey some applications.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2022

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1318808